Anchored Hyperplane Location Problems

Anchored Hyperplane Location Problems

The anchored hyperplane location problem is to locate a hyperplane passing through some given points P ⊆ IR and minimizing either the sum of weighted distances (median problem), or the maximum weighted distance (center problem) to some other points Q ⊆ IR. This problem of computational geometry is analyzed by using nonlinear programming techniques. If the distances are measured by a norm, it wi...

Maxmin location of an anchored ray in 3-space and related problems

Generalized Multicriteria Location Problems

This work concerns a special class of multicriteria optimization problems, obtained from a given single-facility multicriteria planar location problem by adding several new cost functions. By means of a decomposition approach, based on the concept of Pareto reducibility, we have developed together with S. Alzorba and Chr. Günther an implementable algorithm for generating efficient solutions of ...

Reverse facility location problems

In the Nearest Neighbor problem (NN), the objects in the database that are nearer to a given query object than any other objects in the database have to be found. In the conceptually inverse problem, Reverse Nearest Neighbor problem (RNN), objects that have the query object as their nearest neighbor have to be found. Reverse Nearest Neighbors queries have emerged as an important class of querie...

Compact Location Problems

We consider the problem of placing a speciied number (p) of facilities on the nodes of a network so as to minimize some measure of the distances between facilities. This type of problem models a number of problems arising in facility location, statistical clustering , pattern recognition, and processor allocation problems in multiprocessor systems. We consider the problem under three diierent o...